Towards Verifying Model Transformations

نویسندگان

  • Anantha Narayanan
  • Gabor Karsai
چکیده

In model-based software development, a complete design and analysis process involves designing the system using the design language, converting it into the analysis language, and performing the verification and analysis on the analysis model. Graph transformation is increasingly being used to automate this conversion. In such a scenario, it is very important that the conversion preserves the semantics of the design model. This paper discusses an approach to verify this semantic equivalence for each transformation. We will show how to check whether a particular transformation resulted in an output model that preserves the semantics of the input model with respect to a particular property.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Verified Model Transformations

Model-driven software development (MDD) is seen as a promising approach to improve software quality and reduce production costs significantly. However, one of the problems in using MDD especially in the area of safety-critical systems is the lack of verified transformations. The verification of crucial safety properties on the model level is only really useful, if the automatic code generation ...

متن کامل

Rewriting Logic Semantics and Verification of Model Transformations

Model transformations are used in model-driven development for mechanizing the interoperability and integration among modeling languages. Due to the graph-theoretic nature of models, the theory of graph transformation systems and its technological support provide a convenient environment for formalizing and verifying model transformations, which can then be used for defining the semantics of mo...

متن کامل

Towards a Two Layered Verification Approach for Compiled Graph Transformation

As model driven software development (MDSD) is being applied more and more in the safety critical (SC) and dependable system development processes there is an increasing need for verified model transformations to guarantee certain semantic properties to hold after their execution. For instance, when transforming UML models into Petri nets, the results of a formal analysis can be invalidated by ...

متن کامل

Towards Verifiable Model Transformations: A Finite State Example

Embedded software in automotive applications is often used in safety critical applications, where the reliability of the system is of utmost importance. If a model-based development is followed, models of the code are often verified using techniques like model checking, but this in itself does not ensure that the generated code is also verified. Also, design models are often different from anal...

متن کامل

REFINER: Towards Formal Verification of Model Transformations

We present the Refiner tool, which offers techniques to define behavioural transformations applicable on formal models of concurrent systems, reason about semantics preservation and the preservation of safety and liveness properties of such transformations, and apply them on models. Behavioural transformations allow to change the potential behaviour of systems. This is useful for model-driven d...

متن کامل

Towards Modularly Comparing Programs Using Automated Theorem Provers

In this paper, we present a general framework for modularly comparing two (imperative) programs that can leverage single-program verifiers based on automated theorem provers. We formalize (i) mutual summaries for comparing the summaries of two programs, and (ii) relative termination to describe conditions under which two programs relatively terminate. The two rules together allow for checking c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 211  شماره 

صفحات  -

تاریخ انتشار 2008